Average Running Time of the Fast Fourier Transform
نویسنده
چکیده
We compare several algorithms for computing the discrete Fourier transform of n numbers. The number of “operations” of the original Cooley-Tukey algorithm is approximately 2n A(n), where A(n) is the sum of the prime divisors of n. We show that the average number of operations satisfies (l/x)Z,,,2n A(n) (n2/9)(x2/log x). The average is not a good indication of the number of operations. For example, it is shown that for about half of the integers n less than x, the number of “operations” is less than n i 61. A similar analysis is given for Good’s algorithm and for two algorithms that compute the discrete Fourier transform in O(n log n) operations: the chirp-z transform and the mixed-radix algorithm that computes the transform of a series of prime length p in O(p log p) operations.
منابع مشابه
Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملDetermination of Riboflavin by Nanocomposite Modified Carbon Paste Electrode in Biological Fluids Using Fast Fourier Transform Square Wave Voltammetry
Herein, fast Fourier transformation square-wave voltammetry (FFT-SWV) as a novel electrochemical determination technique was used to investigate the electrochemical behavior and determination of Riboflavin at the surface of a nanocomposite modified carbon paste electrode. The carbon paste electrode was modified by nanocomposite containing Samarium oxide (Sm2O3)/reduced gra...
متن کاملA Review of Application of Signal Processing Techniques for Fault Diagnosis of Induction Motors – Part I
Abstract - Use of efficient signal processing tools (SPTs) to extract proper indices for fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The Part1 of the two parts paper focuses on Fourier-based techniques including fast Fourier transform and short time Fourier transform. In this paper, all utilized SPTs which have been employed for fault fete...
متن کاملCompensation of Doppler Effect in Direct Acquisition of Global Positioning System using Segmented Zero Padding
Because of the very high chip rate of global positioning system (GPS), P-code acquisition at GPS receiver will be challenging. A variety of methods for increasing the probability of detection and reducing the average time of acquisition have been provided, among which the method of Zero Padding (ZP) is the most essential and the most widely used. The method using the Fast Fourier Transform (FFT...
متن کاملEfficient Fractal Image Coding using Fast Fourier Transform
The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 1 شماره
صفحات -
تاریخ انتشار 1980